Hypercube emulation of interconnection networks topologies
نویسندگان
چکیده
منابع مشابه
Chordal Topologies for Interconnection Networks
The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. Two geometric characterizations are given, one in the plane and other in the space. Both characterizations facilitate the analysis of their topological properties and corroborate their suitability for implementing interconnection networks for distributed and parallel computers....
متن کاملUsing Hypercube Interconnection Networks for Rsa Cryptography
The RSA (Rivest, Shamir and Adleman) is one of the most preferred algorithms for asymmetric cryptography. Modular exponentiation is the time consuming part of RSA algorithm. It’s a common way to use parallel processing to achieve faster results in terms of speed. In this study, a new method exploiting parallel processing is proposed for RSA cryptography. This parallel method employs the hypercu...
متن کاملConditional matching preclusion for hypercube-like interconnection networks
The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is odd. We develop some general properties on conditional matching preclusion and then analyze the conditional matching preclusion numbers for some ...
متن کاملA class of hierarchical graphs as topologies for interconnection networks
We study some topological and algorithmic properties of a recently defined hierarchical interconnection network, the hierarchical crossed cube HCC(k, n), which draws upon constructions used within the well-known hypercube and also the crossed cube. In particular, we study: the construction of shortest paths between arbitrary vertices in HCC(k, n); the connectivity of HCC(k, n); and one-to-all b...
متن کاملEmbedding Starlike Trees into Hypercube-Like Interconnection Networks
A starlike tree (or a quasistar) is a subdivision of a star tree. A family of hypercube-like interconnection networks called restricted HLgraphs includes many interconnection networks proposed in the literature such as twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes, Mcubes, and generalized twisted cubes. We show in this paper that every starlike tree of degree at most m with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods in the Applied Sciences
سال: 2016
ISSN: 0170-4214
DOI: 10.1002/mma.3820